Laying Out Midimew Networks with Constant Dilation

نویسندگان

  • Guihai Chen
  • Francis C. M. Lau
چکیده

Abst rac t . Midimew networks [1] are mesh-connected networks derived from a subset of degree-4 circulant graphs. They have minimum diameter and average distance among all degree-4 circulant graphs, and are better than some of the most common topologies for parallel computers in terms of various cost measures. Among the many midimew networks, the rectangular ones appear to be most suitable for practical implementation. Unfortunately, with the normal way of laying out these networks on a 2-D plane, long cross wires that grow with the size of the network appear. In this paper, we propose ways to embed rectangular midimew networks in a 2-D grid so that the length of the longest wire is at most a small constant.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Architecture and Network-on-Chip Implementation of a New Hierarchical Interconnection Network

A Midimew-connected Mesh Network (MMN) is a minimal distance mesh with wrap-around links network of multiple basic modules (BMs), in which the BMs are 2D-mesh networks that are hierarchically interconnected for higher-level networks. In this paper, we present the architecture of the MMN, addressing of node, routing of message, and evaluate the static network performance of MMN, TESH, mesh and t...

متن کامل

Products of Networks with Logarithmic Diameter and Fixed Degree

This paper rst presents some general properties of product networks pertinent to parallel ar-chitectures and then focuses on three case studies. These are products of complete binary trees, shuue-exchange, and de Bruijn networks. It is shown that all of these are powerful architectures for parallel computation, as evidenced by their ability to eeciently emulate numerous other archi-tectures. In...

متن کامل

Degree 3 Suffices: A Large-Scale Overlay for P2P Networks

Most peer-to-peer (P2P) networks proposed until now have either logarithmic degree and logarithmic dilation or constant degree and logarithmic dilation. In the latter case (which is optimal up to constant factors), the constant degree is achieved either in expectation or with high probability. We propose the first overlay network, called SkewCCC, with a maximum degree of 3 (minimum possible) an...

متن کامل

The Complexity of Shortest Path and Dilation Bounded Interval Routing

Interval routing is a popular compact routing method for point-to-point networks which found industrial applications in novel transputer routing technology 13]. Recently much eeort is devoted to relate the eeciency (measured by the dilation or the stretch factor) to space requirements (measured by the compactness or the total number of memory bits) in a variety of compact We add new results in ...

متن کامل

Cube Connected Cycles Based Bluetooth Scatternet Formation

Bluetooth is a wireless communication standard developed for personal area networks (PAN) that gained popularity in the last years. It was designed to connect a few devices together, however nowadays there is a need to build larger networks. Construction and maintenance algorithms have great effect on performance of the network. We present an algorithm based on Cube Connected Cycles (CCC) topol...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994